Optimization of Data Mining in Dynamic Environments based on a Component Search Neural Network Algorithm
نویسندگان
چکیده
The searching for patterns and model construction in Data-mining is the important contribution. Previous works report that the component search (CS) algorithm is successful and effective for datamining. Conventional research in pattern search and modeling in data-mining only consider data in a static state. Studies data-mining in dynamic environments are scarce. The artificial neural network (ANN) algorithm can solve dynamic condition problems. This study integrates the CS and ANN algorithm to create the novel (CS-ANN) algorithm that solves pattern-recognition problems and can simply construct manufacturing inspection models for dynamic environments. Simply experimental results indicate that the CS algorithm is computationally efficient for solving pattern-recognition problems and that the ANN algorithm enables simple and efficient modeling of dynamic systems. The CSANN algorithm is effective for pattern-recognition and modeling of dynamic systems.
منابع مشابه
Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملOptimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملArtificial Intelligence Based Approach for Identification of Current Transformer Saturation from Faults in Power Transformers
Protection systems have vital role in network reliability in short circuit mode and proper operating for relays. Current transformer often in transient and saturation under short circuit mode causes mal-operation of relays which will have undesirable effects. Therefore, proper and quick identification of Current transformer saturation is so important. In this paper, an Artificial Neural Network...
متن کامل